A scalable method for run-time loop parallelization

Double Inspection for Run-Time Loop Parallelization

The Inspector/Executor is well-known for parallelizing loops with irregular access patterns that cannot be analyzed statically. The downsides of existing inspectors are that it is hard to amortize their high run-time overheads by actually executing the loop in parallel, that they can only be applied to loops with dependencies that do not change during their execution and that they are often spe...

Run-Time Parallelization for Loops

Current parallelizing compilers cannot extract a significant fraction of the available parallelism in a loop if it has a complex and/or statically insuficiently defined access pattern. In this paper, a run-time technique based on insp/exec scheme (inspector phase and executor phase) is proposed for finding parallelism on loops. Our inspector can determine the wavefronts of a loop with any compl...

Techniques for Speculative Run - Time Parallelization ofLoopsManish

This paper presents a set of new run-time tests for speculative parallelization of loops that defy par-allelization based on static analysis alone. It presents a novel method for speculative array privatization that is not only more eecient than previous methods when the speculation is correct, but also does not require rolling back the computation in case the variable is found not to be privat...

A Case for Combining Compile-Time and Run-Time Parallelization

Run-time Parallelization Techniques for Sparse Applications

Current parallelizing compilers cannot identify a significant fraction of parallelizable loops because they have complex or statically insufficiently defined access patterns. As parallelizable loops arise frequently in practice, we have introduced a novel framework for their identification: speculative parallelization. While we have previously shown that this method is inherently scalable its p...